Locally polyhedral linear inequality systems
نویسندگان
چکیده
منابع مشابه
Newton's method for linear inequality systems
We describe a modified Newton type algorithm for the solution of linear inequality systems in the sense of minimizing the /, norm of infeasibilities. Finite termination is proved, and numerical results are given.
متن کاملUniform Saturation in Linear Inequality Systems
Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related with the preservation of ...
متن کاملPadé Discretization for Linear Systems With Polyhedral Lyapunov Functions
This paper has been motivated by the need to assess the preservation of polyhedral Lyapunov functions for stable continuous-time linear systems under numerical discretization of the transition matrix. This problem arises when discretizing linear systems in such a manner as to preserve a certain type of stability of the discrete time approximation. Our main contribution is to show that a continu...
متن کاملPolyhedral Omega: A New Algorithm for Solving Linear Diophantine Systems
Polyhedral Omega is a new algorithm for solving linear Diophantine systems (LDS), i.e., for computing a multivariate rational function representation of the set of all non-negative integer solutions to a system of linear equations and inequalities. Polyhedral Omega combines methods from partition analysis with methods from polyhedral geometry. In particular, we combine MacMahon’s iterative appr...
متن کاملFormal Abstraction of Linear Systems via Polyhedral Lyapunov Functions
In this paper we present an abstraction algorithm that produces a finite bisimulation quotient for an autonomous discrete-time linear system. We assume that the bisimulation quotient is required to preserve the observations over an arbitrary, finite number of polytopic subsets of the system state space. We generate the bisimulation quotient with the aid of a sequence of contractive polytopic su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)00241-3